import sys
input = sys.stdin.readline
def solve():
a, b, c = map(int, input().split())
cnt1, cnt2 = a-(c-1), b-(c-1)
gcd = 10**(c-1)
X = Y = 1
while len(str(X)) < cnt1:
X *= 2
while len(str(Y)) < cnt2:
Y *= 3
return X*gcd, Y*gcd
for _ in range(int(input())):
print(*solve())#include <bits/stdc++.h>
#define int long long
#define float double
using namespace std;
int power(int n)
{
if (n == 0)
return 1;
return 10 * power(n - 1);
}
void solve()
{
int a, b, c, x, y;
cin >> a >> b >> c;
x = power(a - 1);
cout << x << " ";
int temp = power(b - 1);
y = power(c - 1) + temp;
cout << y << endl;
}
int32_t main()
{
int t = 1;
cin >> t;
while (t--)
solve();
return 0;
}112. Path Sum | 1556A - A Variety of Operations |
136. Single Number | 169. Majority Element |
119. Pascal's Triangle II | 409. Longest Palindrome |
1574A - Regular Bracket Sequences | 1574B - Combinatorics Homework |
1567A - Domino Disaster | 1593A - Elections |
1607A - Linear Keyboard | EQUALCOIN Equal Coins |
XOREQN Xor Equation | MAKEPAL Weird Palindrome Making |
HILLSEQ Hill Sequence | MAXBRIDGE Maximise the bridges |
WLDRPL Wildcard Replacement | 1221. Split a String in Balanced Strings |
1002. Find Common Characters | 1602A - Two Subsequences |
1555A - PizzaForces | 1607B - Odd Grasshopper |
1084A - The Fair Nut and Elevator | 1440B - Sum of Medians |
1032A - Kitchen Utensils | 1501B - Napoleon Cake |
1584B - Coloring Rectangles | 1562B - Scenes From a Memory |
1521A - Nastia and Nearly Good Numbers | 208. Implement Trie |